منابع مشابه
Tight cycles and regular slices in dense hypergraphs
We prove a hypergraph analogue of the Erdős-Gallai theorem: for any δ > 0 there exists n0 such that for any 0 ≤ α ≤ 1, any k-uniform hypergraph H on n ≥ n0 vertices with at least (α+ δ) ( n k ) edges contains a tight cycle of length at least αn. Moreover, H contains tight cycles of all lengths up to αn which are divisible by k. A key tool in our proof is a ‘regular slice lemma’, which is derive...
متن کاملList Colourings of Regular Hypergraphs
We show that the list chromatic number of a simple d-regular r-uniform hypergraph is at least (1/2r log(2r 2) + o(1)) log d if d is large.
متن کاملMaximum hypergraphs without regular subgraphs
We show that an n-vertex hypergraph with no r-regular subgraph has at most 2n−1 + r− 2 edges. We conjecture that if n > r, then every n-vertex hypergraph with no r-regular subgraph having the maximum number of edges contains a full star, that is, 2n−1 distinct edges containing a given vertex. We prove this conjecture for n ≥ 425. The condition that n > r cannot be weakened.
متن کاملRegular self-complementary uniform hypergraphs
A k-uniform hypergraph with vertex set V and edge set E is called t-subset-regular if every t-element subset of V lies in the same number of elements of E. In this paper we establish a necessary condition on n for there to exist a t-subset-regular selfcomplementary k-uniform hypergraph with n vertices. In addition, we show that this necessary condition is also sufficient in the case k = 3 and t...
متن کاملTwo-regular subgraphs of hypergraphs
We prove that the maximum number of edges in a k-uniform hypergraph on n vertices containing no 2-regular subhypergraph is ( n−1 k−1 ) if k ≥ 4 is even and n is sufficiently large. Equality holds only if all edges contain a specific vertex v. For odd k we conjecture that this maximum is ( n−1 k−1 ) + bn−1 k c, with equality only for the hypergraph described above plus a maximum matching omittin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Discrete Mathematics
سال: 2015
ISSN: 1571-0653
DOI: 10.1016/j.endm.2015.06.093